Tootfinder

kangaroo: Grey kangaroo dominance
Dominance relations among a group of free-ranging grey kangaroos (Macropus giganteus). Edge weights represent the frequency of interaction. The two versions below are equivalent.
This network has 17 nodes and 91 edges.
Tags: Social, Animal, Weighted
https://networks.sk…

Bigraph Matching Weighted with Learnt Incentive Function for Multi-Robot Task Allocation
Steve Paul, Nathan Maurer, Souma Chowdhury
https://arxiv.org/abs/2403.07131

Bigraph Matching Weighted with Learnt Incentive Function for Multi-Robot Task Allocation
Most real-world Multi-Robot Task Allocation (MRTA) problems require fast and efficient decision-making, which is often achieved using heuristics-aided methods such as genetic algorithms, auction-based methods, and bipartite graph matching methods. These methods often assume a form that lends better explainability compared to an end-to-end (learnt) neural network based policy for MRTA. However, deriving suitable heuristics can be tedious, risky and in some cases impractical if problems are too c…

This https://arxiv.org/abs/2309.10300 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Vojta's conjecture on weighted projective varieties
We formulate Vojta's conjecture for smooth weighted projective varieties, weighted multiplier ideal sheaves, and weighted log pairs and prove that all three versions of the conjecture are equivalent. In the process, we introduce generalized weighted general common divisors and express them as heights of weighted projective spaces blown-up relative to an exceptional divisor. Furthermore, we prove that assuming Vojta's conjecture for weighted projective varieties one can bound the $\log {\rm h_{w…

kangaroo: Grey kangaroo dominance
Dominance relations among a group of free-ranging grey kangaroos (Macropus giganteus). Edge weights represent the frequency of interaction. The two versions below are equivalent.
This network has 17 nodes and 91 edges.
Tags: Social, Animal, Weighted
https://networks.sk…

Simulating Quantum Circuits by Model Counting
Jingyi Mei, Marcello Bonsangue, Alfons Laarman
https://arxiv.org/abs/2403.07197 https://

Simulating Quantum Circuits by Model Counting
Quantum circuit compilation comprises many computationally hard reasoning tasks that nonetheless lie inside #$\mathbf{P}$ and its decision counterpart in $\mathbf{PP}$. The classical simulation of general quantum circuits is a core example. We show for the first time that a strong simulation of universal quantum circuits can be efficiently tackled through weighted model counting by providing a linear encoding of Clifford+T circuits. To achieve this, we exploit the stabilizer formalism by Knill,…

Bigraph Matching Weighted with Learnt Incentive Function for Multi-Robot Task Allocation
Steve Paul, Nathan Maurer, Souma Chowdhury
https://arxiv.org/abs/2403.07131

Bigraph Matching Weighted with Learnt Incentive Function for Multi-Robot Task Allocation
Most real-world Multi-Robot Task Allocation (MRTA) problems require fast and efficient decision-making, which is often achieved using heuristics-aided methods such as genetic algorithms, auction-based methods, and bipartite graph matching methods. These methods often assume a form that lends better explainability compared to an end-to-end (learnt) neural network based policy for MRTA. However, deriving suitable heuristics can be tedious, risky and in some cases impractical if problems are too c…

This https://arxiv.org/abs/2309.10300 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Vojta's conjecture on weighted projective varieties
We formulate Vojta's conjecture for smooth weighted projective varieties, weighted multiplier ideal sheaves, and weighted log pairs and prove that all three versions of the conjecture are equivalent. In the process, we introduce generalized weighted general common divisors and express them as heights of weighted projective spaces blown-up relative to an exceptional divisor. Furthermore, we prove that assuming Vojta's conjecture for weighted projective varieties one can bound the $\log {\rm h_{w…

This https://arxiv.org/abs/2307.01153 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Integral cohomology rings of weighted Grassmann orbifolds and rigidity properties
In this paper, we introduce `Plücker weight vector' and establish the definition of a weighted Grassmann orbifold $\mbox{Gr}_{\mathbf{b}}(k,n)$, corresponding to a Plücker weight vector `$\mathbf{b}$'. We achieve an explicit classification of weighted Grassmann orbifolds up to certain homeomorphism in terms of the Plücker weight vectors. We study the integral cohomology of $\mbox{Gr}_{\bf b}(k,n)$ and provide some sufficient conditions such that the integral cohomology of $\mbox{Gr}_{\bf b}(…

hens: White Leghorn hens (1946)
Dominance interactions (pecking) among a group of White Leghorn hens, observed in 1946. Edge weights represent the frequency of interaction. The two versions below are equivalent.
This network has 32 nodes and 496 edges.
Tags: Social, Animal, Weighted
https://networks.skewed.de/net/…

kangaroo: Grey kangaroo dominance
Dominance relations among a group of free-ranging grey kangaroos (Macropus giganteus). Edge weights represent the frequency of interaction. The two versions below are equivalent.
This network has 17 nodes and 91 edges.
Tags: Social, Animal, Weighted
https://networks.sk…